New Efficient and Practical v-Fairness (t, n) Multi-Secret Sharing Schemes

Secret sharing plays an important role in protecting confidential information among all participants. A fairness secret sharing scheme assures that a dishonest participant cannot get any advantages over the honest ones in the process of secret reconstruction. Though there are many secret sharing schemes available in the literature, most of them do not satisfy the requirement of fairness. In this paper, we focus on v-fairness (t, n) multi-secret sharing schemes which are (t, n) threshold multi-secret sharing schemes with the feature of fairness even if there are v<t/2 dishonest participants. We show security weaknesses in an existing v-fairness (t, n) multi-secret sharing scheme, and then present two new v-fairness (t, n) multi-secret sharing schemes. Our new schemes are not only secure, but also remove the need for private channels.